Multilinear Singular Value Decomposition for Structured Tensors
نویسنده
چکیده
The Higher-Order SVD (HOSVD) is a generalization of the Singular Value Decomposition (SVD) to higher-order tensors (i.e. arrays with more than two indices) and plays an important role in various domains. Unfortunately, this decomposition is computationally demanding. Indeed, the HOSVD of a third-order tensor involves the computation of the SVD of three matrices, which are referred to as "modes", or "matrix unfoldings". In this paper, we present fast algorithms for computing the full and the rank-truncated HOSVD of third-order structured (symmetric, Toeplitz and Hankel) tensors. These algorithms are derived by considering two specific ways to unfold a structured tensor, leading to structured matrix unfoldings whose SVD can be efficiently computed.
منابع مشابه
A Multilinear Singular Value Decomposition
We discuss a multilinear generalization of the singular value decomposition. There is a strong analogy between several properties of the matrix and the higher-order tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, first-order perturbation effects, etc., are analyzed. We investigate how tensor symmetries affect the decomposition and propose a multilinear generaliz...
متن کاملKrylov-type methods for tensor computations I
Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, and contracted tensor product Krylov recursion. It is proved that, for a given tensor A with multilinear rank-(p, q, r), the minimal Krylov recursion extracts the correct subspaces associated to the tensor in p+ q+r num...
متن کاملDimensionality reduction in higher - order signal processing and rank - ( R 1 , R 2 , . . . , RN ) reduction in multilinear algebra
In this paper we review a multilinear generalization of the singular value decomposition and the best rank-(R1, R2, . . . , RN) approximation of higher-order tensors. We show that they are important tools for dimensionality reduction in higher-order signal processing. We discuss applications in independent component analysis, simultaneous matrix diagonalization and subspace variants of algorith...
متن کاملMultilinear Subspace Analysis of Image Ensembles
Multilinear algebra, the algebra of higher-order tensors, offers a potent mathematical framework for analyzing ensembles of images resulting from the interaction of any number of underlying factors. We present a dimensionality reduction algorithm that enables subspace analysis within the multilinear framework. This N -mode orthogonal iteration algorithm is based on a tensor decomposition known ...
متن کاملBlock tensors and symmetric embeddings
Well known connections exist between the singular value decomposition of a matrix A and the Schur decomposition of its symmetric embedding sym(A) = ([ 0A ; A 0 ]). In particular, if σ is a singular value of A then +σ and −σ are eigenvalues of the symmetric embedding. The top and bottom halves of sym(A)’s eigenvectors are singular vectors for A. Power methods applied to A can be related to power...
متن کامل